BER of MRC for M-QAM with imperfect channel estimation over correlated Nakagami-m fading

In this contribution, we provide an exact BER analysis for M-QAM transmission over arbitrarily correlated Nakagami-m fading channels with maximal-ratio combining (MRC) and imperfect channel estimation at the receiver. Assuming an arbitrary joint fading distribution and a generic pilot-based channel estimation method, we derive an exact BER expression that involves an expectation over (at most) 4 variables, irrespective of the number of receive antennas. The resulting BER expression includes well-known PDFs and the PDF of only the norm of the channel vector. In order to obtain the latter PDF for arbitrarily correlated Nakagami-m fading, several approaches from the literature are discussed. For identically distributed and arbitrarily correlated Nakagami-m channels with integer m, we present several BER performance results, which are obtained from numerical evaluation and confirmed by straightforward computer simulations. The numerical evaluation of the exact BER expression turns out to be much less time-consuming than the computer simulations

Simplified Log-MAP Algorithm for Very Low-Complexity Turbo Decoder Hardware Architectures

Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, yet effective, n-input max∗ approximation algorithm is proposed with the aim being its efficient implementation for very low-complexity turbo decoder hardware architectures. The simplification is obtained using an appropriate digital circuit for finding the first two maximum values in a set of n data that embeds the computation of a correction term. Various implementation results show that the proposed architecture is simpler by 30%, on average, than the constant logarithmic-maximum a posteriori (Log-MAP) one, in terms of chip area with the same delay. This comes at the expense of very small performance degradation, in the order of 0.1 dB for up to moderate bit error rates, e.g., 10e−5, assuming binary turbo codes. However, when applying scaling to the extrinsic information, the proposed algorithm achieves almost identical Log-MAP turbo code performance for both binary and double-binary turbo codes, without increasing noticeably the implementation complexity

Secrecy Rate Optimization for Cooperative Cognitive Radio Networks Aided by a Wireless Energy Harvesting Jammer

In this paper, a novel wireless energy harvesting cooperative jammer (EH-CJ)-aided transmission scheme, which can enhance the security for cooperative cognitive radio networks (CCRNs), is proposed. The EH-CJ first harvests energy from ambient radio frequency (RF) signals transmitted from the primary transmitter (PT). This energy is then used to transmit jamming noise (JN), so that the performance of eavesdroppers' receptions is degraded, and also to deliver additional power to the secondary energy receiver (ER). In this way, the proposed scheme can enhance the security and extend the lifetime for CCRNs. For this system, we formulate an optimization problem for maximizing the secrecy rate of the secondary system under transmit power constraints at the secondary transmitter as well as the EH-CJ, minimum harvested energy at the secondary ER and information rate at the primary receiver (PR). Since this optimization problem is not convex, we propose a two-stage optimization algorithm based upon the Charnes-Cooper transformation and rank-one relaxation to solve it. Computer simulation results have demonstrated that the proposed EH-CJ-aided scheme achieves better secrecy rate performance, as compared to an isotropic JN scheme as well as compared to an equivalent scheme which does not use the aid of EH-CJ